CRUSH: A New Cryptographic Hash Function using Iterated Halving Technique
نویسندگان
چکیده
Most of the currently accepted designs for cryptographic hash functions are in the style of a block cipher in feed-forward mode. With increasing interest in all forms of cryptanalysis, this limited choice might become a single point of failure in computer security, and so we seek alternative paradigms. In this paper an entirely new approach, based on iterated halving (IH), is proposed for the design of secure and efficient hash functions. This class of algorithms may be instantiated with any reduced round block cipher, allowing a subtle security/performance tradeoff and a direct performance comparison with the existing approach. We present details of a new hash function, “CRUSH”, from the IH class.
منابع مشابه
Breaking the ICE - Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions
The security of hash functions has recently become one of the hottest topics in the design and analysis of cryptographic primitives. Since almost all the hash functions used today (including the MD and SHA families) have an iterated design, it is important to study the general security properties of such functions. At Crypto 2004 Joux showed that in any iterated hash function it is relatively e...
متن کاملA New Ring-Based SPHF and PAKE Protocol On Ideal Lattices
emph{ Smooth Projective Hash Functions } ( SPHFs ) as a specific pattern of zero knowledge proof system are fundamental tools to build many efficient cryptographic schemes and protocols. As an application of SPHFs, emph { Password - Based Authenticated Key Exchange } ( PAKE ) protocol is well-studied area in the last few years. In 2009, Katz and Vaikuntanathan described the first lattice-based ...
متن کاملDomain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration
We study the problem of securely extending the domain of a collision resistant compression function. A new construction based on directed acyclic graphs is described. This generalizes the usual iterated hashing constructions. Our main contribution is to introduce a new technique for hashing arbitrary length strings. Combined with DAG based hashing, this technique gives a new hashing algorithm. ...
متن کاملSignature Identification Scheme Based on Iterated Function Systems
Since 1984 many schemes have been proposed for digital signature protocol, among them those that based on discrete log and factorizations. However a new identification scheme based on iterated function (IFS) systems are proposed and proved to be more efficient. In this study the proposed identification scheme is transformed into a digital signature scheme by using a one way hash function. It is...
متن کاملSecurity of Iterated Hash Functions Based on Block Ciphers
Cryptographic hash functions obtained by iterating a round function constructed from a block cipher and for which the hash-code length is twice the block length m of the underlying block cipher are considered. The computational security of such hash functions against two particular attacks, namely, the free-start target and free-start collision attacks, is investigated; these two attacks differ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004